class Solution 
{
public:
    int searchInsert(vector<int>& nums, int target) 
    {
        // 1、下标初始化
        int left = 0, right = nums.size() - 1;
        // 2、二分查找大于等于 target 的左边界
        while(left < right)
        {
            int mid = left + (right - left) / 2;
            if(nums[mid] < target) left = mid + 1;
            else right = mid;
        }
        // 3、处理最终的返回值
        if(nums[left] < target) return left + 1;
        else return left;
    }
};